package com.jack.leetcode.math;

import java.util.HashMap;
import java.util.Map;

public class 罗马数字转整数 {

    public int romanToInt(String s) {
        int result = 0;
        for(int i = 0;i<s.length();i++){
            int curValue = getValue(s.charAt(i));
            if(i<s.length()-1){
                int nextValue = getValue(s.charAt(i+1));
                if(curValue<nextValue){
                    curValue = -curValue;
                }
            }
            result +=curValue;
        }
        return result;
    }

    private int getValue(char ch) {
        switch(ch) {
            case 'I': return 1;
            case 'V': return 5;
            case 'X': return 10;
            case 'L': return 50;
            case 'C': return 100;
            case 'D': return 500;
            case 'M': return 1000;
            default: return 0;
        }
    }
}
